† Corresponding author. E-mail:
Exploring the emergence and maintenance of cooperation in social dilemma is valuable and it arises considerable concerns of many researchers. In this paper, we propose a mechanism to promote cooperation, called benefit community, in which cooperators linking together form a common benefit community and all their payoffs obtained from game are divided coequally. The robustness of conclusions is tested for the PDG (prisoners’ dilemma game) on square lattice and WS small world network. We find that cooperation can be promoted by this typical mechanism, especially, it can diffuse and prevail more easily and rapidly on the WS small world network than it on the square lattice, even if a big temptation to defect b. Our research provides a feasible direction to resolve the social dilemma.
According to Darwinian theory of evolution,[1] each rational individual is selfish enough to make profits for themselves no matter who others are and what they are doing. However, cooperation plays a totally important role in almost all kinds of fields, such as biology, sociology, economics, and so on.[2–7] Understanding the spontaneous emergence and maintenance of altruism and cooperation among selfish individuals is an extremely interesting and significant challenge, which has attracted a lot of attention of researchers in recent decades. In order to solve this puzzle, evolutionary game theory,[8–10] a classical and powerful theoretical framework, which is extensively used, has provided an effective tool to investigate the evolution of cooperation. In basic game theory models, the prisoners’ dilemma game (PDG)[11–13] is the most common and frequently used, attracting a lot of attention both in theoretical and experimental fields. In PDG, two equivalent players play a game in which they have to choose either cooperate (C) or defect (D) at the same time. Each of the simultaneous cooperators receives a reward R, and mutual defection results in a punishment P, the cooperator whose partner defects gets S (the sucker’s payoff), while the defector gains T (the temptation to defect). Accordingly, a PDG exists only if two conditions are satisfied:
As a metaphor for the problems surrounding the evolution of cooperative behavior, the prisoners’ dilemma has gained a great deal of attention and many researchers have been burying themselves in solving it. Nowak and May,[14] initially explored the consequences of spatial structure and found that cooperation increases when placing all the players on a two-dimensional lattice. Since then, various types of spatial topology have been introduced into subsequential studies,[15] in which, players, who are arranged on a structured topology, including random regular graphs,[16–19] BA scale-free network,[20–24] small world network,[25–30] and interdependent network,[31–34] can interact only with their direct neighbors. In addition, five rules for the evolution of cooperation which are kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection, were reviewed by Nowak[35] in 2006, interpreting the emergence and maintenance of cooperation in social dilemma. Furthermore, a large amount of mechanisms facilitating cooperative behaviors have been proposed in recent years’ studies, such as reputation,[36–39] social norms,[40–45] rewards,[46–50] and punishments,[51–54] teaching ability,[55] environment,[56–58] aspiration,[59,60] memory,[61,62] interference of noise,[63] self-interaction,[64] external forcing,[65] decoy effect,[66] to name but a few.
In real world, there are many groups in which members help each other, regardless of you and me. For example, if a man marries a woman, and they become a family, everything of them, including incomes, consumption, friends, and so on, will be owned and shared in common. Besides, recalling everyone’s student days, teachers always divide the whole class into several learning groups to improve the average grades of the whole class. Every student with high scores is appointed to help those who are not good at learning in the same group. In addition, motivated by Nowak and May, who found that cooperators form compact clusters to prevent being invaded by defectors, we come up with an idea about benefit community among cooperators in order to reduce the defectors’ aggression, to some extent, in which one cooperator links with its cooperative neighbors until there are no cooperators among cooperative ones’ neighbors, and all of their payoffs are equally divided when a game ends. Different from other works on dynamic networks, on which players have the choice to drop connections and re-establish connections with players, our model is the one on a static network, where cooperators compact their common benefit communities, and all of the benefit communities evolve with the evolution of players’ strategy. The results of computer simulations show the promotion of cooperation on the square lattice and the WS small world network, what is more important, we obtain a better result on the WS small world network.
The rest of this paper is arranged as follows. In Section
In this paper, we consider an evolutionary prisoners’ dilemma game with a new mechanism of benefit community. Initially, a population with fixed size N is located on two kinds of network, in which each node represents one player and each link denotes the pairwise relationships between players, including a regular square lattice of size L × L with four nearest neighbors under a periodic boundary condition, and a WS small world network with ρ = 0.01 and k = 4, of which ρ and k represent the rewiring probability and the degree, respectively. Here, each node is arranged by a cooperator or a defector with equal probability initially. We denote players’ strategy by the two-dimensional vector S, which is (1,0)T if a player is a cooperator and is (0,1)T if a player is a defector. Following a common parametrization in most of the literature, we choose the weak PDG in which the parameters are defined as R = 1, T = b, S = P = 0, where b (
At each time step, choosing to cooperate or defect, player i plays the game with its nearest four neighbors simultaneously and gains its payoff
After each game, a random cooperator links with its cooperative neighbors until there are no cooperators among its neighbors, and all of them compose a benefit community in which all of their payoffs are divided equally when a round of game ends, while a defector’s payoff is not divided. It is worth noting that each cooperator can be in only one benefit community. Therefore, one player i obtains its final payoff,
The game is implemented by Monte Carlo (MC) simulations. First, a randomly selected player i receives its payoff according to Eq. (
The results of simulations showed below are obtained on a square lattice sized 100 × 100. In order to avoid errors, we also apply it on a WS small world network of size N = 10000, k = 4, ρ = 0.01. Then, we observe the variation trend of the fraction of cooperators pc. To assure suitable accuracy, the equilibrium pc is gained by averaging over 10 independent runs, in which we calculate the average result of the last 1000 time steps of total 10000 time steps.
We begin with the results for the evolutionary PDG on square lattice network. The fraction of cooperators pc in dependence on the temptation to defect b is demonstrated in Fig.
In order to further explore and discuss the evolution of cooperation in spatial PDG, it is necessary to clarify its potential microscopic dynamics. In Fig.
To vividly depict the time courses of the evolutionary PDG and explain why our new mechanism can effectively deal with the social dilemmas, we plot the characteristic snapshots of distribution of cooperators (red) and defectors (blue) on the square lattice for various temptation to defect b, including 1.005, 1.01, 1.2, and 1.225, when t=0,10,100,10000. From a rough scan of these snapshots, the influences of b on the evolutionary processes are extremely big. At the early stage, the most of nodes are occupied by defectors due to the relatively big benefit b. After that, many clusters and benefit communities are formed by cooperators, trying to defend the invasion of defectors. As described in Fig.
Then, we gain the results of simulations on the WS small world network with node size N = 10000, rewiring probability ρ = 0.01, degree of nodes K = 4. As depicted in Fig.
In order to further illustrate the fraction of cooperation pc over time, the curves of time courses are presented in Fig.
To further explain the evolutionary process vividly, we depict the typical snapshots of distribution of cooperators (red) and defectors (blue) on the WS small world network for various temptation to defect b, including 1.25, 1.35, 1.55, and 1.6 when t=0,10,100,10000 in Fig.
In behavioral science, most of cooperators form groups, helping each other and once someone defects, he or she is eliminated from the group. Inspired by this phenomenon, we have investigated the evolutionary process of the prisoners’ dilemma game on the square lattice and the WS small world network with a special mechanism, of which cooperators linking together contact a benefit community and divide all their payoffs equally. In addition, we find this mechanism can effectively promote the evolution of cooperation by observing and analyzing the results of MC (Monte Carlo) simulation. Especially, contrasting to that on the square lattice, it is more effective for this extraordinary mechanism to facilitate cooperation on the WS small world network, while the fraction of cooperators decreases with rising temptation to defect b. In summary, such a coevolution mechanism brings a beneficial environment for cooperators to avoid the invasion of defectors. We hope that this work can interest and inspire more studies to deal with the social dilemma.
[1] | |
[2] | |
[3] | |
[4] | |
[5] | |
[6] | |
[7] | |
[8] | |
[9] | |
[10] | |
[11] | |
[12] | |
[13] | |
[14] | |
[15] | |
[16] | |
[17] | |
[18] | |
[19] | |
[20] | |
[21] | |
[22] | |
[23] | |
[24] | |
[25] | |
[26] | |
[27] | |
[28] | |
[29] | |
[30] | |
[31] | |
[32] | |
[33] | |
[34] | |
[35] | |
[36] | |
[37] | |
[38] | |
[39] | |
[40] | |
[41] | |
[42] | |
[43] | |
[44] | |
[45] | |
[46] | |
[47] | |
[48] | |
[49] | |
[50] | |
[51] | |
[52] | |
[53] | |
[54] | |
[55] | |
[56] | |
[57] | |
[58] | |
[59] | |
[60] | |
[61] | |
[62] | |
[63] | |
[64] | |
[65] | |
[66] |